منابع مشابه
Lectures on Spectral Graph Theory
Contents Chapter 1. Eigenvalues and the Laplacian of a graph 1 1.1. Introduction 1 1.2. The Laplacian and eigenvalues 2 1.3. Basic facts about the spectrum of a graph 6
متن کاملSpectral graph theory
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall concentrate mainly on the adjacency matrix of (undirected) graphs, and also discuss briefly the Laplacian. We shall show that spectral properies (the eigenvalues and eigenvectors) of these matrices pro...
متن کاملSpectral graph theory
Spectral graph theory is a fast developing field in modern discrete mathematics with important applications in computer science, chemistry and operational research. By merging combinatorial techniques with algebraic and analytical methods it creates new approaches to hard discrete problems and gives new insights in classical Linear Algebra. The proposed minisymposium will bring together leading...
متن کاملA Semi-Supervised Clustering Method Based on Graph Contraction and Spectral Graph Theory
Semi-supervised learning is a machine learning framework where learning from data is conducted by utilizing a small amount of labeled data as well as a large amount of unlabeled data (Chapelle et al., 2006). It has been intensively studied in data mining and machine learning communities recently. One of the reasons is that, it can alleviate the time-consuming effort to collect “ground truth” la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publikacije Elektrotehni?kog fakulteta - serija: matematika
سال: 2005
ISSN: 0353-8893
DOI: 10.2298/petf0516088s